On 2-dimensional Simple Sets in n-dimensional Cubic Grids
نویسندگان
چکیده
منابع مشابه
On Refinement of 2-Dimensional Grids
The subject of this paper are grid refinements arising in finite element methods and their embedding into grids. We concentrate on embeddings with dilation 1 and construct for a class of grid refinements their embeddings with optimal load. For general cases we show that the problem to determine the minimal load is NP-complete.
متن کاملOn Re nement of 2-Dimensional Grids
The subject of this paper are grid reenements arising in nite element methods and their embedding into grids. We concentrate on embeddings with dilation 1 and construct for a class of grid reenements their embeddings with optimal load. For general cases we show that the problem to determine the minimal load is NP-complete.
متن کاملDiscrete topology on N-dimensional square tessellated grids
Topology preservation and detection is a well known concept in the processing of 2and 3-dimensional binary images. These images can be considered as sets that are mapped on square tessellated (hyper cubic) grids. This paper describes how the formalisms derived for 2D and 3D images can be expanded to N-dimensional images, i.e. binary point sets that are aligned on an N-dimensional square tessell...
متن کاملOn the Embedding of Reenements of 2-dimensional Grids ?
We consider the problem of constructing embeddings of 2-dimensional FEM graphs into grids. Our goal is to minimize the edge-congestion and dilation and optimize the load. We introduce some heuris-tics, analyze their performance, and present experimental results comparing the heuristics with the methods based on the usage of standard graph partitioning libraries.
متن کاملOn the Embedding of Refinements of 2-dimensional Grids
We consider the problem of constructing embeddings of 2-dimensional FEM graphs into grids. Our goal is to minimize the edge-congestion and dilation and optimize the load. We introduce some heuris-tics, analyze their performance, and present experimental results comparing the heuristics with the methods based on the usage of standard graph partitioning libraries.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2009
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-009-9195-x